Distributed Quiescence Detection in Multiagent Negotiation
نویسندگان
چکیده
In a distributed multiagent negotiation involving multiple issues, it is often desirable to finalize deals only when all related issues are resolved. We present a quiescence detection protocol based on the DijkstraScholten algorithm for distributed termination detection. The protocol operates as a layer on top of an underlying mediated negotiation protocol. If agents conform to the detection protocol, the detection process terminates iff the negotiation is quiescent. We discuss agent incentives to deviate from the protocol, and describe extensions that enforce adherence with respect to the most significant potential deviations.
منابع مشابه
Simulation of Negotiation Policies in Distributed Multiagent Resource Allocation
In distributed approaches to multiagent resource allocation, the agents belonging to a society negotiate deals in small groups at a local level, driven only by their own rational interests. We can then observe and study the effects such negotiation has at the societal level, for instance in terms of the economic efficiency of the emerging allocations. Such effects may be studied either using th...
متن کاملSelf-Adjustable Autonomy in Multi-Agent Systems
These questions have led to a wide variety of research disciplines. To make concrete these various research disciplines, several distributed architectures have been proposed. However, the use of these distributed architectures requires a very complex parametrization. This complexity is the result of the type of problem resolution which is founded on negotiation. Negotiation is one of the most i...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملPreferences in Semi-Cooperative Agreement Problems
We define the Extended Incremental Multiagent Agreement Problem with Preferences (EIMAPP). In EIMAPP, variables arise over time. For each variable, a set of distributed agents receives reward for agreeing on which option to assign to the variable. Each of the agents has an individual, privately owned preference function for choosing options. EIMAPPs reflect real world multiagent agreement probl...
متن کاملModeling Privately Owned Information in the Incremental Multiagent Agreement Problem
In this paper we define the Extended Incremental Multiagent Agreement Problem with Preferences (EIMAPP). In EIMAPP, variables arise over time. For each variable some set of distributed agents must agree on which option (from a given set) to assign to the variable. Each of the agents may have a different preference about which option to use. EIMAPP is designed to reflect many real world multiage...
متن کامل